Optimised Design and Analysis of All-Optical Networks

This PhD thesis presents a suite of methods for optimising design and for analysing blocking probabilities of all-optical networks. It thus contributes methodical knowledge to the field of computer assisted planning of optical networks. A two-stage greenfield optical network design optimiser is developed, based on shortest-path algorithms and a comparatively new metaheuristic called simulated allocation. It is able to handle design of all-optical mesh networks with optical cross-connects, considers duct as well as fibre and node costs, and can also design protected networks. The method is assessed through various experiments and is shown to produce good results and to be able to scale up to networks of realistic sizes. A novel method, subpath wavelength grouping, for routing connections in a multigranular all-optical network where several wavelengths can be grouped and switched at band and fibre level is presented. The method uses an unorthodox routing strategy focusing on common subpaths rather than individual connections, and strives to minimise switch port count as well as fibre usage. It is shown to produce cheaper network designs than previous methods when fibre costs are comparatively high. A new optical network concept, the synchronous optical hierarchy, is proposed, in which wavelengths are subdivided into timeslots to match the traffic granularity. Various theoretical properties of this concept are investigated and compared in simulation studies. An integer linear programming model for optical ring network design is presented. Manually designed real world ring networks are studied and it is found that the model can lead to cheaper network design. Moreover, ring and mesh network architectures are compared using real world costs, and it is found that optical cros..

Building a Context World for Dynamic Service Composition

Dynamic service composition requires responding and adapting to changes in the computing environment when orchestrating existing services into one or more new services that fit better to a composite application. This paper abstracts the changes of the environment as a context world to store the physical contexts of the computing environment, user profiles and computed results of services as well. We use ontology techniques to model the domain concepts of application contexts. Context Condition/Effect Description Language is designed to describe the dynamic semantics of the requirements and capabilities of goals and services in a concise and editable manner. Goal-driven and planning techniques are used to dynamically implement the service composition according to the domain knowledge and facts in the context world. ?2010 IEEE.EI

Goal-Driven Context-aware Service Composition

Two important aspects are associated with service composition. One is to understand the needs and constraints for a new added-value composite service, and otherwise it would lead to an ad-hoc effort for service composition. The second is to reflect the changes of computing environment to the service composition to catch up the on-demand of users. This paper introduces a goal-driven approach to specify the user requirements and demands that guides the service composition, and proposes context awareness to adapt to a dynamically changing environment. Computing contexts, including physical context, user profile and computed results, are gathered by various services, and imported into an ontology based a context repository. A Goal Description Language, Context Condition/Effect are designed to describe the dynamic semantics of goal requirements and service capability. A planner is designed and implemented to dynamically compose services based on the current contexts, and a service runner is designed and implemented to invoke proper services based on the contexts and interactions with users. ?2010 IEEE.EI

Matching of Bigraphs

We analyze the matching problem for bigraphs. In particular, we present a sound and complete inductive characterization of matching of binding bigraphs. Our results pave the way for a provably correct matching algorithm, as needed for an implementation of bigraphical reactive systems